Improved Lowness Results for Solvable Black-box Group Problems

نویسنده

  • N. V. Vinodchandran
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Algorithms for a Set of Group Theoretic Problems

We study two group theoretic problems, Group Intersection and Double Coset Membership, in the setting of black-box groups, where Double Coset Membership generalizes a set of problems, including Group Membership, Group Factorization, and Coset Intersection. No polynomial-time classical algorithms are known for these problems. We show that for solvable groups, there exist efficient quantum algori...

متن کامل

Recursive Estimation with Implicit Constraints

Recursive estimation or Kalman filtering usually relies on explicit model functions, that directly and explicitly describe the effect of the parameters on the observations. However, many problems in computer vision, including all those resulting in homogeneous equation systems, are easier described using implicit constraints between the observations and the parameters. By implicit we mean, that...

متن کامل

On Secure Multi-party Computation in Black-Box Groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x2 · · ·xn in an arbitrary finite group (G, ·), where the input of party Pi is xi ∈ G for i = 1, . . . , n. For flexibility, we are interested in protocols for fG which require only black-box access to the group G (i.e. the only ...

متن کامل

A Taxonomy of Constraints in Simulation-Based Optimization

The types of constraints encountered in black-box and simulation-based optimization problems differ significantly from those treated in nonlinear programming. We introduce a characterization of constraints to address this situation. We provide formal definitions for several constraint classes and present illustrative examples in the context of the resulting taxonomy. This taxonomy, denoted QRAK...

متن کامل

Improved Black Box Multigrid for Definite and Indefinite Problems

A two-level analysis method for certain separable problems is introduced. Unlike standard two-level analysis methods, based on Fourier analysis, it is based on spectral analysis, hence applicable to non-normal problems and to certain problems with variable coeecients. It motivates the deenition of improved versions of Black Box Multigrid for diiusion problems with discontinuous coeecients and i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997